The Squared Slacks Transformation in

The Squared Slacks Transformation in Nonlinear Programming

We recall the use of squared slacks used to transform inequality constraints into equalities and several reasons why their introduction may be harmful in many algorithmic frameworks routinely used in nonlinear programming. Numerical examples performed with the sequential quadratic programming method illustrate those reasons.

Additive slacks- based measure with undesirable output and feedback for a two-stage structure

This paper develops slacks-based measure (SBM) and additive SBM (ASBM) to evaluate efficiency of decision making units (DMUs) in a two-stage structure with undesirable outputs and feedback variables from the internal perspective. The SBM model is linearized  for a specific weight and the ASBM model is reformulated as a second order cone program. The target values for all inputs, outputs (both d...

Evaluation of supply chain operations using Slacks-based measure of efficiency

Bank branches efficiency assessment using dynamic data envelopment analysis approach to SBM

A new approach or model to the dynamic DEA, referred to as the adjusted dynamic DEA, is proposed in this study. Adjusted dynamic DEA optimizes the production activity of DMUs by introducing adjustment variables to modify the interconnecting activities between consecutive terms, solving conflicts that arise between terms and between management and shareholders. The non-oriented SBM model is used...

Symmetric Primal-dual Path following Algorithms for Semideenite Programming

In this paper a symmetric primal-dual transformation for positive semideenite programming is proposed. For standard SDP problems, after this symmetric transformation the primal variables and the dual slacks become identical. In the context of linear programming, existence of such a primal-dual transformation is a well known fact. Based on this symmetric primal-dual transformation we derive Newt...